Convexity Conditions of Planar Parametric Curves and its Properties
نویسندگان
چکیده
Based on the original geometrical definition of the planar parametric convex curve, the local convexity and the global convexity on parametric curve are discussed, a few properties are obtained, and a necessary and sufficient condition is presented for the local convexity of a general planar parametric curve.
منابع مشابه
An Optimal G^2-Hermite Interpolation by Rational Cubic Bézier Curves
In this paper, we study a geometric G^2 Hermite interpolation by planar rational cubic Bézier curves. Two data points, two tangent vectors and two signed curvatures interpolated per each rational segment. We give the necessary and the sufficient intrinsic geometric conditions for two C^2 parametric curves to be connected with G2 continuity. Locally, the free parameters w...
متن کاملOn convexity of planar curves and its application in CAGD
This paper presents a necessary and sufficient condition for global convexity of planar curves and some applications of this condition. In addition, various ideas about the concept of convexity in CAGD are discussed. © 1997 Elsevier Science B.V.
متن کاملConvexity Measure for Shapes with Partially Extracted Boundaries
Shape descriptors are used in many computer vision tasks. Convexity is one of the most widely used shape descriptors in practical applications and also one of the most studied in the literature. There are already several defined convexity measures. The most standard one comes from the comparison between a given shape and its convex hull, but there also other approaches. Independently of whether...
متن کاملMetamorphosis of Planar Parametric Curves Via Curvature Interpolation
This work considers the problem of metamorphosis interpolation between two freeform planar curves. Given two planar parametric curves, the curvature signature of the two curves is linearly blended, yielding a gradual change that is not only smooth but also employs intrinsic curvature shape properties, and hence is highly appealing. In order to be able to employ this curvature blending, we prese...
متن کاملSOME PROPERTIES FOR FUZZY CHANCE CONSTRAINED PROGRAMMING
Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009